New kernels for fast mesh-based motion estimation
نویسندگان
چکیده
منابع مشابه
New kernels for fast mesh-based motion estimation
Mesh-based motion estimation—also known as control grid interpolation or warping—provides a smoother estimated intensity field compared to the traditional block-matching algorithm (BMA), resulting in most cases in a more realistic motion field and smaller estimation error. In mesh-based motion, unlike BMA, the computation of a motion vector is affected by its neighboring vectors. This interdepe...
متن کاملAdaptive search area for fast motion estimation
In this paper a new method for determining the search area for motion estimation algorithm based on block matching is suggested. In the proposed method the search area is adaptively found for each block of a frame. This search area is similar to that of the full search (FS) algorithm but smaller for most blocks of a frame. Therefore, the proposed algorithm is analogous to FS in terms of reg...
متن کاملNew adaptive interpolation schemes for efficient mesh- based motion estimation
Motion estimation and compensation is an essential part of existing video coding systems. The mesh-based motion estimation (MME) produces smoother motion field, better subjective quality (free from blocking artifacts), and higher peak signal-to-noise ratio (PSNR) in many cases, especially at low bitrate video communications, compared to the conventional block matching algorithm (BMA). However, ...
متن کاملNew adaptive interpolation schemes for efficient meshbased motion estimation
Motion estimation and compensation is an essential part of existing video coding systems. The mesh-based motion estimation (MME) produces smoother motion field, better subjective quality (free from blocking artifacts), and higher peak signal-to-noise ratio (PSNR) in many cases, especially at low bitrate video communications, compared to the conventional block matching algorithm (BMA). Howev...
متن کاملNew fast algorithms for the estimation of block motion vectors
Block motion estimation using exhaustive search is computationally intensive. Previously proposed fast algorithms reduce the computation by limiting the number of locations searched. This is sometimes done a t the expense of the accuracy of the estimates and can result in motion-compensated prediction images with an appreciably higher imean squared error (MSE) than that obtained by exhaustive s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Circuits and Systems for Video Technology
سال: 2001
ISSN: 1051-8215
DOI: 10.1109/76.894281